A note on finding minimum mean cycle
نویسندگان
چکیده
In a directed graph with edge weights, the mean weight of a directed cycle is the weight of its edges divided by their number. The minimum cycle mean of the graph is the minimum mean weight of a cycle. Karp gave a characterization of minimum cycle mean and an O(nm) algorithm to compute it, where n is the number of vertices and m is the number of edges. However, an algorithm he suggested for identifying a cycle with this mean weight is not correct. We propose an alternative.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملAlgorithms for finding the minimum cycle mean in the weighted directed graph
In this paper we study the problem of finding the minimum cycle mean in the weighted directed graph. The computational aspect of some algorithms for solving this problem is discussed and two algorithms for minimum cycle mean finding in the weighted directed graph are proposed.
متن کاملA Note on Minimax Inverse Generalized Minimum Cost Flow Problems
Given a generalized network and a generalized feasible flow f, we consider a problem finding a modified edge cost d such that f is minimum cost with respect to d and the maximum deviation between the original edge cost and d is minimum. This paper shows the relationship between this problem and minimum mean circuit problems and analyze a binary search algorithm for this problem.
متن کاملآیا اثر افزایش حداقل دستمزدها بر تورم در اقتصاد ایران به وضعیت ادوار تجاری اقتصاد کلان مرتبط است؟
Over past decades there have been conflicting views on whether raising the minimum wage increases inflation. This study updates and expands earlier research into this subject and fills a void in the empirical literature by studying that the impacts of the minimum wage on inflation could be altered in the different economic situations. In framework of cost push inflation theoretical background, ...
متن کاملFaster parametric shortest path and minimum-balance algorithms
We use Fibonacci heaps to improve a parametric shortest path algorithm of Karp and Orlin, and we combine our algorithm and the method of Schneider and Schneider’s minimum-balance algorithm to obtain a faster minimum-balance algorithm. For a graph with n vertices and m edges, our parametric shortest path algorithm and our minimum-balance algorithm both run in O(nm + n logn) time, improved from O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 127 شماره
صفحات -
تاریخ انتشار 2017